Efficient skyline retrieval with arbitrary similarity measures.

Dependency Analysis Framework for Software Service Delivery.

Rule based synonyms for entity extraction from noisy text.

Search result summarization and disambiguation via contextual dimensions.

Automatic Sales Lead Generation from Web Data.

Automatic Sales Lead Generation from Web Data.

On Learning Asymmetric Dissimilarity Measures.

A model for handling approximate
We introduce a Bayesian model, BayesANIL, that is capable of estimating uncertainties associated with the labeling process. Given a labeled or partially labeled training corpus of text documents, the model estimates the joint distribution of training documents and class labels by using a generalization of the Expectation Maximization algorithm. The estimates can be used in standard classification models to reduce error rates. Since uncertainties in the labeling are taken into account, the model provides an elegant mechanism to deal with noisy labels. We provide an intuitive modification to the EM iterations by re-estimating the empirical distribution in order to reinforce feature values in unlabeled data and to reduce the influence of noisily labeled examples. Considerable improvement in the classification accuracies of two popular classification algorithms on standard labeled data-sets with and without artificially introduced noise, as well as in the presence and absence of unlabeled data, indicates that this may be a promising method to reduce the burden of manual labeling. 1.
Interpretable Hierarchical Clustering by Constructing an Unsupervised Decision Tree.

Automatic categorization of web sites based on source types.

EShopMonitor A Web Content Monitoring Tool.

Learning spatially variant dissimilarity %28SVaD%29 measures.
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure between the data points in feature space. This makes the type of clusters identified highly dependent on the assumed similarity measure. Building on recent work in this area, we formally define a class of spatially varying dissimilarity measures and propose algorithms to learn the dissimilarity measure automatically from the data. The idea is to identify clusters that are compact with respect to the unknown spatially varying dissimilarity measure. Our experiments show that the proposed algorithms are more stable and achieve better accuracy on various textual data sets when compared with similar algorithms proposed in the literature.
Learning spatially variant dissimilarity %28SVaD%29 measures.
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure between the data points in feature space. This makes the type of clusters identified highly dependent on the assumed similarity measure. Building on recent work in this area, we formally define a class of spatially varying dissimilarity measures and propose algorithms to learn the dissimilarity measure automatically from the data. The idea is to identify clusters that are compact with respect to the unknown spatially varying dissimilarity measure. Our experiments show that the proposed algorithms are more stable and achieve better accuracy on various textual data sets when compared with similar algorithms proposed in the literature.
A hierarchical monothetic document clustering algorithm for summarization and browsing search results.
Organizing Web search results into a hierarchy of topics and subtopics facilitates browsing the collection and locating results of interest. In this paper, we propose a new hierarchical monothetic clustering algorithm to build a topic hierarchy for a collection of search results retrieved in response to a query. At every level of the hierarchy, the new algorithm progressively identifies topics in a way that maximizes the coverage while maintaining distinctiveness of the topics. We refer the proposed algorithm to as DisCover. Evaluating the quality of a topic hierarchy is a non-trivial task, the ultimate test being user judgment. We use several objective measures such as coverage and reach time for an empirical comparison of the proposed algorithm with two other monothetic clustering algorithms to demonstrate its superiority. Even though our algorithm is slightly more computationally intensive than one of the algorithms, it generates better hierarchies. Our user studies also show that the proposed algorithm is superior to the other algorithms as a summarizing and browsing tool.
The eShopmonitor A comprehensive data extraction tool for monitoring Web sites.

Content%2DBased Image Retrieval Based on a Fuzzy Approach.
 A typical content-based image retrieval (CBIR) system would need to handle the vagueness in the user queries as well as the inherent uncertainty in image representation, similarity measure, and relevance feedback. In this paper, we discuss how fuzzy set theory can be effectively used for this purpose and describe an image retrieval system called FIRST (Fuzzy Image Retrieval SysTem) which incorporates many of these ideas. FIRST can handle exemplar-based, graphical-sketch-based, as well as linguistic queries involving region labels, attributes, and spatial relations. FIRST uses Fuzzy Attributed Relational Graphs (FARGs) to represent images, where each node in the graph represents an image region and each edge represents a relation between two regions. The given query is converted to a FARG, and a low-complexity fuzzy graph matching algorithm is used to compare the query graph with the FARGs in the database. The use of an indexing scheme based on a leader clustering algorithm avoids an exhaustive search of the FARG database. We quantify the retrieval performance of the system in terms of several standard measures. 
Classification of Text Documents Based on Minimum System Entropy.



Soft Computing in E%2DCommerce.

One Step Evolutionary Mining of Context Sensitive Associations and Web Navigation Patterns.
this paper is our previous work [9, 10, 11] where we have proposed new robust and fuzzy rela-   Partial support of this work was provided by the National Science Foundation Grant IIS 9800899 to Raghu Krishnapuram and National Science Foundation CAREER Award IIS 0133948 to Olfa Nasraoui
An Evolutionary Approach to Mining Robust Multi%2DResolution Web Profiles and Context Sensitive URL Associations.
this paper is our previous work    where we have proposed new robust and fuzzy relational clustering techniques that allow Web usage clusters to overlap and that can detect and handle outliers in the data set. A new subjective similarity measure between two Web sessions, that captures the organization of a Web site, was also presented as well as a new mathematical model for &#034;robust&#034; Web user profiles    and quantitative evaluation means for their validation. Unfortunately, the computation of a huge relation matrix added a heavy computational and storage burden to the clustering process
Mining Generalised Disjunctive Association Rules.

A Clustering Algorithm for Asymmetrically Related Data with Applications to Text Mining.

Handwritten Character Membership Function Estimation for Word Recognition.

Categorization of Image Databases for Efficient Retrieval Using Robust Mixture Decomposition.
In this paper, we present a robust mixture decomposition technique that automatically finds a compact representation of the data in terms of categories. We apply it to the problem of organizing databases for efficient retrieval. The time taken for retrieval is shown to be an order of magnitude smaller than that of exhaustive search methods. We report results on the VisTex texture image database from MIT Media Lab.  Keywords: Categorization, Image Databases, Mixture Decomposition, Robust, Organization.  2  List of Symbols  X set of feature vectors  n number of vectors  x i i-th vector  ` mixture density parameters  c number of components  ` i parameters of the i-th component  m i mean vector of component i  C i covariance matrix of component i  P (! i ) a priori probability of component i   ij a posteriori probability of component i  j(t) annealing function  d dimensionality of data  r number of retained vectors  3  1. Introduction  One of the possible interactions between a user and a ...
On Mining Web Access Logs.
The proliferation of information on the world wide web has made the personalization of this information space a necessity. One possible approach to web personalization is to mine typical user profiles from the vast amount of historical data stored in access logs. In the absence of any a priori knowledge, unsupervised classification or clustering methods seem to be ideally suited to analyze the semi-structured log data of user accesses. In this paper, we define the notion of a “user session”, as well as a dissimilarity measure between two web sessions that captures the organization of a web site. To extract a user access profile, we cluster the user sessions based on the pair-wise dissimilarities using a robust fuzzy clustering algorithm that we have developed. We report the results of experiments with our algorithm and show that this leads to extraction of interesting user profiles. We also show that it outperforms association rule based approaches for this task. 1
Relevance Feedback for Content%2DBased Retrieval using the Choquet Integral.

Extracting Web User Profiles Using Relational Competitive Fuzzy Clustering.
The proliferation of information on the web... In this paper, we define the notion of a &#034;user session&#034; as being a temporally compact sequence of Web accesses by a user. We also define a new distance measure between two Web sessions that captures the organization of a Web site. The Competitive Agglomeration clustering algorithm which can automatically cluster data into the optimal number of components is extended so that it can work on relational data. The resulting Competitive Agglomeration for Relational Data (CARD) algorithm can deal with complex, non-Euclidean, distance/similarity measures. This algorithm was used to analyze Web server access logs successfully and obtain typical session profiles of users.
Extracting Web User Profiles Using Relational Competitive Fuzzy Clustering.
The proliferation of information on the web... In this paper, we define the notion of a &#034;user session&#034; as being a temporally compact sequence of Web accesses by a user. We also define a new distance measure between two Web sessions that captures the organization of a Web site. The Competitive Agglomeration clustering algorithm which can automatically cluster data into the optimal number of components is extended so that it can work on relational data. The resulting Competitive Agglomeration for Relational Data (CARD) algorithm can deal with complex, non-Euclidean, distance/similarity measures. This algorithm was used to analyze Web server access logs successfully and obtain typical session profiles of users.
A Fuzzy Approach to Content%2DBased Image Retrieval.
Fuzzy set methods have been used to model and manage uncertainty in various aspects of image processing, pattern recognition and computer vision. High-level computer vision applications hold a great potential for fuzzy set theory because of its links to natural language. Linguistic scene description, a language-based interpretation of regions and their relationships, is one such application that is starting to bear the fruits of fuzzy set theoretic involvement. In this paper, we are expanding on two earlier endeavors. We introduce new families of fuzzy directional relations that rely on the computation of histograms of forces. These families preserve important relative position properties. They provide inputs to a fuzzy rule base that produces logical linguistic descriptions along with assessments as to the validity of the descriptions. Each linguistic output uses hedges from a dictionary of about thirty adverbs and other terms that can be tailored to individual users. Excellent results from several synthetic and real image examples show the applicability of this approach. Keywords  Relative Positions, Force Histograms, Spatial Relations, Linguistic Descriptions, Scene Understanding, Fuzzy Logic.  2  1. 
Warehousing and Mining Web Logs.

A Robust Competitive Clustering Algorithm With Applications in Computer Vision.
This paper addresses three major issues associated with conventional partitional clustering, namely, sensitivity to initialization, difficulty in determining the number of clusters, and sensitivity to noise and outliers. The proposed Robust Competitive Agglomeration (RCA) algorithm starts with a large number of clusters to reduce the sensitivity to initialization, and determines the actual number of clusters by a process of competitive agglomeration. Noise immunity is achieved by incorporating concepts from robust statistics into the algorithm. RCA assigns two different sets of weights for each data point: the first set of constrained weights represents degrees of sharing, and is used to create a competitive environment and to generate a fuzzy partition of the data set. The second set corresponds to robust weights, and is used to obtain robust estimates of the cluster prototypes. By choosing an appropriate distance measure in the objective function, RCA can be used to find a...
Are fuzzy definitions of basic attributes of image objects really useful%3F

A comparison of Gaussian and Pearson mixture modeling for pattern recognition and computer vision applications.

On Fuzzy Clustering and Content Based Access to Networked Video Databases.
Video Databases and video on demand represent an important application of the evolving Global Information Infrastructure. However, video querying involves a lot of user interaction and feedback based query refinement, which can generate large traffic volumes on the network if full video segments are sent. To aid in efficient Video browsing, search and retrieval across the network, we need to find good compact representations for long video sequences. Representative Frames (Rframes) provide such a representation. Extant algorithms use use scene change detection to segment video into shots and pick Rframes. However, scene change detection techniques fail badly in presence of gradual scene changes which are quite prevalent in most videos. We present another way of finding Rframe using fuzzy clustering without dealing with any scene change detection algorithms. Fuzzy clusters provide a more natural approach to this problem since membership of a frame in some particular scene is not binary....
An overview of membership function generation techniques for pattern recognition.

Neural and Fuzzy Methods in Handwriting Recognition.

A robust approach to image enhancement based on fuzzy logic.

Clustering by competitive agglomeration.
The proliferation of information on the web... In this paper, we define the notion of a &#034;user session&#034; as being a temporally compact sequence of Web accesses by a user. We also define a new distance measure between two Web sessions that captures the organization of a Web site. The Competitive Agglomeration clustering algorithm which can automatically cluster data into the optimal number of components is extended so that it can work on relational data. The resulting Competitive Agglomeration for Relational Data (CARD) algorithm can deal with complex, non-Euclidean, distance/similarity measures. This algorithm was used to analyze Web server access logs successfully and obtain typical session profiles of users.
A Robust Clustering Algorithm Based on Competitive Agglomeration and Soft Rejection of Outliers.

A robust algorithm for automatic extraction of an unknown number of clusters from noisy data.

Application of the least trimmed squares technique to prototype%2Dbased clustering.

A Fuzzy%2DRule%2DBased Image Enhancement Method for Medical Applications.

Image enhancement based on fuzzy logic.

Uncertainty management for rule%2Dbased systems with applications to image analysis.

The Fuzzy C Quadric Shell clustering algorithm and the detection of second%2Ddegree curves.

Morphological methods for detection and classification of edges in range images.

Fuzzy%2Dset%2Dbased hierarchical networks for information fusion in computer vision.

Fitting an unknown number of lines and planes to image data through compatible cluster merging.
r-I
Determination of Three%2DDimensional Object Location and Orientation from Range Images.
r-I
Reply to David A. Pintsov.

Reply to David A. Pintsov.

Curved object location by Hough transformations and inversions.
r-I
